Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing

Static Scheduling for Synchronous Data Flow Graphs

This paper addresses the issue of determining the iteration bound for a synchronous data flow graph (SDFG) and determining whether or not a SDFG is live based on some calculations done. The main result of this paper is finding an iteration bound equation that is used to find an integral static schedule for the SDFG, where a node is issued at the beginning of a clock cycle. We show that we can s...

Compiling Dataflow Programs for Digital Signal Processing

Testing Techniques for Data-Flow Synchronous Programs

Three approaches to the problem of testing synchronous data-flow programs written in LUSTRE are presented. LUSTRE is a language well-adapted to both the specification and the development of reactive software. The first approach automatically transforms a set of LUSTRE invariant properties characterizing the environment of the reactive program into a constrained random generator of test data seq...

Static Scheduling for Cyclo Static Data Flow Graphs

There are few processes which display cyclically changing but predefined behavior. These processes can be represented using cyclo static data flow graphs (CSDFG). This capability results in a higher degree of parallelism. In this paper we present the iteration bound for a CSDFG which is used to find the integral static schedule and determine whether a csdf is live or not based on some calculati...

A Mixed Synchronous-asynchronous Approach for Digital Signal Processing

SIGNAL PROCESSING D. Galinec THOMSON Multimedia R&D France Cesson-S evign e, France E-mail: galinec@li .fr J.-L. Dekeyser and P. Marquet U.S.T.L. Villeneuve d'Ascq, France E-mail: fdekeyser, marquetg@li .fr ABSTRACT Signal processing applications are bound by severe constraints: e ciency an reliability are the major of it. To obey these constraints two main approaches exist: the synchronous app...